Layout of the Cube-connected Cycles without Long Wires

نویسندگان

  • Guihai Chen
  • Francis C. M. Lau
چکیده

Preparata and Vuillemin proposed the cube connected cycles CCC in and in the same paper gave an asymptotically optimal layout scheme for the CCC While all the known optimal layouts including the Preparata Vuillemin layout of the CCC have long wires we give a new layout scheme which has no long wires while keeping the asymptotically optimal area Hence we can conclude that the CCC can be laid out optimally within a constant factor both in area and in wire length We also show how large a constant factor blow up in area is needed in order not to produce any long wire in the layout

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tighter Layouts of the Cube-Connected Cycles

ÐPreparata and Vuillemin proposed the cube-connected cycles (CCC) and its compact layout in 1981 [17]. We give a new layout of the CCC which uses less than half the area of the Preparata-Vuillemin layout. We also give a lower bound on the layout area of the CCC. The area of the new layout deviates from this bound by a small constant factor. If we aunfoldo the cycles in the CCC, the resulting st...

متن کامل

A tight layout of the cube-connected cycles

Preparata and Vuillemin proposed the cube-connected cycles (CCC) in 1981 16], and in the same paper, gave an asymptotically-optimal layout scheme for the CCC. We give a new layout scheme for the CCC which requires less than half of the area of the Preparata-Vuillemin layout. We also give a non-trivial lower bound on the layout area of the CCC. There is a constant factor of 2 between the new lay...

متن کامل

Multilayer VLSI Layout for Interconnection Networks

Current VLSI technology allows more than two wiring layers and the number is expected to rise in future. In this paper, we show that, by designing VLSI layouts directly for an L-layer model, the layout area for a variety of networks can be reduced by a factor of about L 2 2 compared to the layout area required under a 2-layer model, and the volume and maximum wire length can be reduced by a fac...

متن کامل

Yield Enhancement Designs for Wsi Cube Connected Cycles

In this paper, we present and analyze yield enhancement designs for wafer scale Cube Connected Cycles (CCC). Improvements in yield can be achieved through silicon area reduction and/or through the incorporation of defect/fault tolerance into the architecture. Consequently, we first propose a new compact layout strategy for CCC. We then present a novel implementation of wafer scale CCC based on ...

متن کامل

A Perfect Load Balancing Algorithm on Cube-Connected Cycles

A simple yet efficient algorithm was presented by Jan and Huang recently to distribute loads evenly on multiprocessor computers with hypercube interconnection networks. That algorithm was developed based on the well-known dimension exchange method. However, the error accumulation suffered by other algorithms based on the dimension exchange method is avoided by exploiting the notion of regular d...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Comput. J.

دوره 44  شماره 

صفحات  -

تاریخ انتشار 2001